Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem
نویسندگان
چکیده
Article history: Received 29 November 2007 Received in revised form 6 May 2014 Accepted 22 August 2014 Available online 26 September 2014
منابع مشابه
Verifiable multi-secret sharing based on LFSR sequences
In verifiable multi-secret sharing schemes (VMSSs), many secrets can be shared but only one share is kept by each user and this share is verifiable by others. In this paper, we propose two secure, efficient, and verifiable (t, n) multi-secret sharing schemes, namely Scheme-I and Scheme-II. Scheme-I is based on the Lagrange interpolating polynomial and the LFSR-based public key cryptosystem. The...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملNew efficient and practical verifiable multi-secret sharing schemes
In 2006, Zhao et al. proposed a practical verifiable multi-secret sharing based on Yang et al.’s and Feldman’s schemes. In this paper we propose two efficient, computationally secure ðt; nÞ, and verifiable multi-secret sharing schemes based on homogeneous linear recursion. The first scheme has the advantage of better performance, a new simple construction and various techniques for the reconstr...
متن کاملVerifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves
Inthispaper,wepropose twosecureverifiablemulti-secret sharingschemes thatarebasedonnon-homogeneous linearrecursionsandelliptic curvesoverZN .Suchschemeshavesimpleconstructionandverificationphases.Moreover thesehavevarious techniques for the reconstruction phase. The security of the proposed schemes is based on the security of the ECRSA cryptosystem and the intractability of the ECDLP. 2007 Else...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Sci.
دوره 294 شماره
صفحات -
تاریخ انتشار 2015